A Krylov subspace method for the approximation of bivariate matrix functions
نویسنده
چکیده
Bivariate matrix functions provide a unified framework for various tasks in numerical linear algebra, including the solution of linear matrix equations and the application of the Fréchet derivative. In this work, we propose a novel tensorized Krylov subspace method for approximating such bivariate matrix functions and analyze its convergence. While this method is already known for some instances, our analysis appears to result in new convergence estimates and insights for all but one instance, Sylvester matrix equations.
منابع مشابه
Uniform Approximation of φ-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
We consider the approximation of the matrix φ-functions that appear in exponential integrators for stiff systems of differential equations. For stiff systems, the field-of-values of the occurring matrices is large and lies somewhere in the left complex half-plane. In order to obtain an efficient method uniformly for all matrices with a field-of-values in the left complex half-plane, we consider...
متن کاملRational Krylov approximation of matrix functions: Numerical methods and optimal pole selection∗
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large-scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift-and-invert Arnoldi met...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملSuperlinear convergence of the rational Arnoldi method for the approximation of matrix functions
A superlinear convergence bound for rational Arnoldi approximations to functions of matrices is derived. This bound generalizes the well-known superlinear convergence bound for the CG method to more general functions with finite singularities and to rational Krylov spaces. A constrained equilibrium problem from potential theory is used to characterize a max-min quotient of a nodal rational func...
متن کامل